Silhouette of a random polytope

نویسندگان

  • Marc Glisse
  • Sylvain Lazard
  • Julien Michel
  • Marc Pouget
چکیده

We consider random polytopes defined as the convex hull of a Poisson point process on a sphere in R3 such that its average number of points is n. We show that the expectation over all such random polytopes of the maximum size of their silhouettes viewed from infinity is Θ( √ n).

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the worst-case complexity of the silhouette of a polytope

We give conditions under which the worst-case size of the silhouette of a polytope is sub-linear.

متن کامل

Visual Hull Rendering with Multi-view Stereo Refinement

We present a system for rendering novel viewpoints from a set of calibrated and silhouette-segmented images using the visual hull together with multi-view stereo. The visual hull predicted from the object silhouettes is used to restrict the search range of the multi-view stereo. This reduces redundant computation and the possibility of incorrect matches. Unlike previous visual hull approaches, ...

متن کامل

Fast extraction of polyhedral model silhouettes from moving viewpoint on curved trajectory

The efficient extraction of model silhouettes is essential in many applications, such as non-photorealistic rendering, backface culling, shadow computation, and computing swept volumes. For dynamically moving viewpoints, efficient silhouette extraction is more important for system performance. Accordingly, this paper presents an incremental update algorithm for computing a perspective silhouett...

متن کامل

The Polytope of k-Star Densities

This paper describes the polytope Pk;N of i-star counts, for all i 6 k, for graphs on N nodes. The vertices correspond to graphs that are regular or as regular as possible. For even N the polytope is a cyclic polytope, and for odd N the polytope is well-approximated by a cyclic polytope. As N goes to infinity, Pk;N approaches the convex hull of the moment curve. The affine symmetry group of Pk;...

متن کامل

A sweep-plane algorithm for generating random tuples in simple polytopes

A sweep-plane algorithm of Lawrence for convex polytope computation is adapted to generate random tuples on simple polytopes. In our method an affine hyperplane is swept through the given polytope until a random fraction (sampled from a proper univariate distribution) of the volume of the polytope is covered. Then the intersection of the plane with the polytope is a simple polytope with smaller...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • JoCG

دوره 7  شماره 

صفحات  -

تاریخ انتشار 2016